package demo2;

public class Test {
    public static void main(String[] args) {
        BinarySearchTree binarySearchTree = new BinarySearchTree();
        BinarySearchTree.TreeNode root = null;
        root = binarySearchTree.insert(root,12);
        root = binarySearchTree.insert(root,21);
        root = binarySearchTree.insert(root,5);
        root = binarySearchTree.insert(root,18);
        root = binarySearchTree.insert(root,9);
        binarySearchTree.inorder(root);
        binarySearchTree.remove(root,9);
        System.out.println("==");
        binarySearchTree.inorder(root);
    }
}
